Some Comparison Theorems for Sturm–Liouville Eigenvalue Problems
نویسندگان
چکیده
منابع مشابه
Localization Theorems for Nonlinear Eigenvalue Problems
Abstract. Let T : Ω → C be a matrix-valued function that is analytic on some simplyconnected domain Ω ⊂ C. A point λ ∈ Ω is an eigenvalue if the matrix T (λ) is singular. In this paper, we describe new localization results for nonlinear eigenvalue problems that generalize Gershgorin’s theorem, pseudospectral inclusion theorems, and the Bauer-Fike theorem. We use our results to analyze three non...
متن کاملOn Cheng’s Eigenvalue Comparison Theorems
We prove Cheng’s eigenvalue comparison theorems [4] for geodesic balls within the cut locus under weaker geometric hypothesis, Theorems (1.1, 3.1, 3.2) and we also show that there are certain geometric rigidity in case of equality of the eigenvalues. This rigidity becomes isometric rigidity under upper sectional curvature bounds or lower Ricci curvature bounds. We construct examples of smooth m...
متن کاملSome Unusual Matrix Eigenvalue Problems
We survey some unusual eigenvalue problems arising in different applications. We show that all these problems can be cast as problems of estimating quadratic forms. Numerical algorithms based on the well-known Gauss-type quadrature rules and Lanczos process are reviewed for computing these quadratic forms. These algorithms reference the matrix in question only through a matrix-vector product op...
متن کاملSome Dichotomy Theorems for Neural Learning Problems
The computational complexity of learning from binary examples is investigated for linear threshold neurons. We introduce combinatorial measures that create classes of infinitely many learning problems with sample restrictions. We analyze how the complexity of these problems depends on the values for the measures. The results are established as dichotomy theorems showing that each problem is eit...
متن کاملA New Inexact Inverse Subspace Iteration for Generalized Eigenvalue Problems
In this paper, we represent an inexact inverse subspace iteration method for computing a few eigenpairs of the generalized eigenvalue problem Ax = Bx [Q. Ye and P. Zhang, Inexact inverse subspace iteration for generalized eigenvalue problems, Linear Algebra and its Application, 434 (2011) 1697-1715 ]. In particular, the linear convergence property of the inverse subspace iteration is preserved.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 2001
ISSN: 0022-247X
DOI: 10.1006/jmaa.2001.7589